Some Qualitative Properties in Polling SystemsEitan ALTMAN

نویسندگان

  • Eitan ALTMAN
  • Panagiotis KONSTANTOPOULOS
  • Zhen LIU
چکیده

Architectures parall eles, Bases de donn ees, R eseaux et Syst emes distribu es Abstract Consider a polling system with K 1 queues and a single server that visits the queues in a cyclic order. The polling discipline in each queue is of general gated-type or exhaustive-type. We assume that in each queue the arrival times form a Poisson process, and that the service times, the walking times as well as the setup times form sequences of independent and identically distributed random variables. For such a system, we provide suucient conditions under which the vector of queue lengths is stable. We treat several criterions for stability: the ergodicity of the process, the geometric ergodicity, and the geometric rate of convergence of the rst moment. The ergodicity implies the weak convergence of station times, intervisit times and cycle times. Next, we show that the queue lengths, station times, intervisit times and cycle times are stochastically increasing in arrival rates, in service times, in walking times and in setup times. The stability conditions and the stochastic monotonicity results are extended to the polling systems with additional customer routing between the queues, as well as bulk and correlated arrivals. For polling systems with mixed limited, gated and exhaustive service disciplines and without setup times, we prove that the weighted sum of mean waiting times increases in the arrival rate, in the rst and second moments of the the service times and in the variances of the walking times. This monotonicity also holds with respect to the mean walking times if they are deterministic or if there are \many queues" or the system is heavily loaded. Finally, we prove that the mean cycle time, the mean intervisit time and the mean station times are invariant under general service disciplines and general stationary arrival and service processes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Bounds and Pathwise Stability for Generalized Vacation and Polling Systems

We consider several models for a generalized vacation or polling system with a general (in particular, non-Poisson) arrival process. Our results are given in the context of an in put-output process operating over successive cycles", in which the service mechanism can be in an up" mode (processing) or down" mode (e.g., vacation, walking). Our primary mo tivation is polling systems, in which th...

متن کامل

Polling on a Graph with General Arrival and Service Time Distribution Polling on a Graph with General Arrival and Service Time Distribution

Polling sur un graphe avec des temps d'inter-arriv ees et de services avec distributions g en erales Abstract Nous consid erons un syst eme de polling sur un graphe avec des temps d'inter-arriv ees, de services et de d eplacements du serveur qui forment des suites i.i.d. Nous pr esentons des conditions suusantes et n ecessaires de stabilit e, en utilisant une analyse de la d erive de la charge ...

متن کامل

Control of Polling in Presence of Vacations in Heavy Traffic with Applications to Satellite and Mobile Radio Systems

42 7] M. Bramson. State space collapse with application to heavy traac limits for multiclass queueing networks. Optimal and approximately optimal control policies for queues in heavy traac.

متن کامل

On Elevator polling with globally gated regime

We consider a polling system consisting of N queues and a single server where polling is performed according to an Elevator (scan) scheme. The server rst serves queues in the `up' direction, i.e. in the order 1,2,...,N-1,N, and then serves these queues in the opposite (`down') direction, i.e. visiting them in the order N,N-1,...,2,1. The server then changes direction again, and so on. A globall...

متن کامل

Analysis of a TCP system under polling-type reduction-signal procedures

The performance of a Transmission Control Protocol (TCP) for a system with N connections sharing a common Active Queue Management (AQM) is analyzed for both AdditiveIncrease Multiplicative-Decrease (AIMD) and MultiplicativeIncrease Multiplicative-Decrease (MIMD) control mechanisms, where reduction signals follow either a cyclic or a probabilistic polling-type procedure. The Laplace-Stieltjes Tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992